Introduction to Data Structures

Stacks

Introduction to Linked List

Create Node and Linked List

Insertion at Starting of Linked List

Traversal in Linked List

Deletion in Linked List

Introduction to Queues

Create a Queue Class and Enqueue Items

Binary Trees in Python

Introduction to Binary Trees

Create a Node in Binary Tree

Insertion at Root of Binary Tree

Insertion in Binary Search Tree

Traversal in Binary Search Tree

Introduction to Heap Data Structure

Heaps Implementation in Python

Introduction to Graphs

Graph Adjacency List in Python

Breadth First Search in Graph

Depth First Search using Recursion

Dijkstra Shortest Path Algorithm

Union Find (Disjoint Set)

Union by Rank

Kruskal's Algorithm

Bellman Ford Shortest Path Algorithm

Bellman Ford Algorithm: Detect Negative Cycles